Daisies and Other Turán Problems
نویسندگان
چکیده
Our aim in this note is to make some conjectures about extremal densities of daisy-free families, where a ‘daisy’ is a certain hypergraph. These questions turn out to be related to some Turán problems in the hypercube, but they are also natural in their own right. We start by giving the daisy conjectures, and some related problems, and shall then go on to describe the connection with vertex-Turán problems in the hypercube.
منابع مشابه
Darwinian evolution does not rule out the gaia hypothesis.
This study explores so-called Darwinian Daisyworlds mathematically rigorously in detail. The original Daisyworld was introduced by Watson & Lovelock (1983) to demonstrate how two species of daisies regulate the global temperature of their planet through competition among these species against the rising solar luminosity, i.e. the Gaia hypothesis. Its variants are Darwinian Daisyworlds in which ...
متن کاملSymmetry in Turán Sums of Squares Polynomials from Flag Algebras
Turán problems in extremal combinatorics concern asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful semidefinite programming based methods to find sums of squares that establish edge density inequalities in Turán problems. Working with polynomial analogs of the flag algebra entities...
متن کاملChromatic Turán problems and a new upper bound for the Turán density of Ks-4
Chromatic Turán problems and a new upper bound for the Turán density of K We consider a new type of extremal hypergraph problem: given an r-graph F and an integer k ≥ 2 determine the maximum number of edges in an F-free, k-colourable r-graph on n vertices. Our motivation for studying such problems is that it allows us to give a new upper bound for an old problem due to Turán. We show that a 3-g...
متن کاملPicking the right spot: crab spiders position themselves on flowers to maximize prey attraction
In plant-pollinator interactions, pollinating insects provide reproductive service to plants and receive food rewards. Flowers advertise the presence of nectar or pollen through various characteristics, including visual displays. In daisies (Chrysanthemum frutescens), the center of the inflorescence appears as a UV-absorbing bull’s-eye that attracts pollinators, for example honeybees. Thomisus ...
متن کاملTurán Problems on Non-Uniform Hypergraphs
A non-uniform hypergraph H = (V,E) consists of a vertex set V and an edge set E ⊆ 2V ; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be limn→∞maxGn hn(Gn), where the maximum is taken over all H-free hypergraphs Gn on n vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 20 شماره
صفحات -
تاریخ انتشار 2011